Scope based indexing prioritization

ABSTRACT

Methods and systems provide a tool for prioritizing the ordering of outstanding indexing work in order to bring a particular portion of an indexing source up to date quickly and to reduce the likelihood of inconsistencies between an index-backed view and a direct view of a source. In accordance with the described embodiments, indexing of items can be prioritized based upon a user&#39;s view or metadata contained within a query. Further, in at least some embodiments, the tool can decide the order to index items based upon multiple prioritization requests.

BACKGROUND

Searching and browsing over the information stored in a computing deviceis an important task. In order to speed up these operations an indexergoes through the information and builds indices by interrogating asource and capturing descriptive properties and token occurrenceinformation for each item in the source. Doing so allows for fastsearching and metadata-based queries over the source. Performing thisinterrogation can, however, be a resource intensive process that caninterfere with the normal utilization of the computing device.Accordingly, most indexing solutions employ some form of “back-off” toslow the rate of indexing and prevent indexing from consuming an undueamount of resources.

Thus, whether or not some form of back-off is employed, this slowedindexing rate can lead to a potential inconsistency between the itemsrepresented by the actual source being interrogated and those stored ina database of an indexing solution. As such, the indexing solution canlag behind the actual source being interrogated resulting in a failureto be in full synchronization with the source. This inconsistency orlack of synchronization can lead to inaccurate results and can frustratethe user.

SUMMARY

Methods and systems provide a tool for prioritizing the ordering ofoutstanding indexing work in order to bring a particular portion of anindexing source up to date quickly and to reduce the likelihood ofinconsistencies between an index-backed view and a direct view of asource. In accordance with the described embodiments, indexing of itemscan be prioritized based upon a user's view or metadata contained withina query. Further, in at least some embodiments, the tool can decide theorder to index items based upon multiple prioritization requests.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an operating environment in accordance with one ormore embodiments.

FIG. 2 is a flow diagram that describes steps in a method in accordancewith one or more embodiments.

FIG. 3 is a flow diagram that describes steps in a method in accordancewith one or more embodiments.

FIG. 4 illustrates an example priority queue in accordance with one ormore embodiments.

FIG. 5 illustrates an example prioritization stack in accordance withone or more embodiments.

FIG. 6 is a block diagram of an example system that can be utilized toimplement one or more embodiments.

DETAILED DESCRIPTION

Overview

Methods and systems provide a tool for prioritizing the ordering ofoutstanding indexing work in order to bring a particular portion of anindexing source up to date quickly and to reduce the likelihood ofinconsistencies between an index-backed view and a direct view of asource. In accordance with the described embodiments, indexing of itemscan be prioritized based upon a user's view or metadata contained withina query. Further, in at least some embodiments, the tool can decide theorder to index items based upon multiple prioritization requests.

In one described embodiment a software component, referred to as anindexer, prioritizes items to be indexed based on a query that isassociated with those items. Based on this prioritization, the indexercan utilize sufficient resources to perform the indexing whilemaintaining synchronization with the source being indexed. In thediscussion that follows, a first section entitled “OperatingEnvironment” is provided that describes an environment in which thevarious embodiments may operate. Following this, a section entitled“Example Methods” describes example methods in accordance with one ormore embodiments. After that, a section entitled “ImplementationExample” provides and describes some example implementations of anindexing solution. Finally, a section entitled “Example System” isprovided and describes an example system in which the indexing solutioncan be utilized.

Operating Environment

FIG. 1 illustrates an operating environment in accordance with one ormore embodiments, generally at 100. Operating environment 100 includesmultiple different computing devices, examples of which are shown at102, 104, 106, and 108. The computing devices can be used by a user toconsume or otherwise interact with content, examples of which caninclude content utilized by the indexer described below. Individualcomputing devices can typically include one or more processors 110, oneor more computer-readable media 112, an operating system 114 and one ormore applications 116 that reside on the computer-readable media andwhich are executable by the processor(s).

In addition, in one or more embodiments, computer readable media 112 caninclude software in the form of an indexer 117 that performs indexing onfiles, databases or other information, such as that described herein.For example, the indexer can index a portion of a database based on aquery, as well as prioritize multiple different queries as describedbelow. Typically, an indexer makes searching and browsing more efficientby building a database to summarize and centralize information found ineach indexed item. The database also contains a number of differentkinds of indices that organize the summarized information to allowefficient searching and browsing. The process of populating the databaseis organized by having a list of all the items that need to be processedbecause they are new or have changed since last processed.

The computer-readable media can include, by way of example and notlimitation, all forms of volatile and non-volatile memory and/or storagemedia that are typically associated with a computing device. Such mediacan include ROM, RAM, flash memory, hard disk, removable media and thelike.

In addition, in at least some embodiments, environment 100 includes anetwork 118, such as a local network or the Internet, via which contentcan be received and sent. Content and other data or information can bereceived over network 118 by way of a server 120 that has access to thecontent and/or information associated with the content. In at least someembodiments, server 120 can include an indexer 122 as well.

The computing devices can be embodied as any suitable computing devicesuch as, by way of example and not limitation, a desktop computer (suchas computing device 106), a portable computer (such as computing device104), a handheld computer such as a personal digital assistant (e.g.,computing device 102), a cell phone (such as computing device 108), andthe like. One example of a computing device is shown and described belowin relation to FIG. 6.

Having discussed the general notion of an example operating environmentin which various embodiments can operate, consider now a discussion ofexample methods of operation in accordance with the describedembodiments.

Example Methods

FIG. 2 is a flow diagram that describes steps in a method in accordancewith one embodiment generally at 200. The method can be implemented inconnection with any suitable hardware, software, firmware or combinationthereof. In at least some embodiments, the method can be implementedusing a system such as the one described above. The order in which themethod is described is not intended to be construed as a limitation, andany number of the described steps can be combined in any order toimplement the method as appropriate.

Step 202 prioritizes items to be indexed. This step can be performed inany suitable way. For example, in one or more embodiments, indexableitems may be assigned a higher or lower prioritization in response to auser action such as a pivoted view action or an explicit search. Inaddition, the indexer can prioritize items that are tagged asdirectories, such as items that generate other items, ahead ofnon-directory items. This allows the indexer to have more knowledgeabout what items are to be indexed to provide a way to quickly honorrequests to prioritize certain locations or to get statistics regardingthe status of a particular location. This also provides a way for theitems that a user would most likely be searching to be prioritizedbefore other items.

Beyond the basic prioritization of directories, items in general canfurther, in at least some embodiments, be prioritized according to abasic set of rules that can be inferred from knowing an item's URL. Thepriority of items, in this regard, can be influenced by properties suchas, by way of example and not limitation, whether a particular item hasbeen indexed before, whether the file type of the item has a registeredproperty handler, whether the file type of the item has a registeredIFilter handler, whether the file is located in a common location thatusers store data such as profile or library locations, and/or whetherthe file is located in a location not commonly used to store user datasuch as an operating system directory. This list of properties isintended to be illustrative and not exclusive. Other properties notlisted may also influence the priority of items. By way of example andnot limitation, items with property handlers such as a picture or JPEGcan be prioritized over an extension that is not understood.Additionally, common places that a user has personal files can beprioritized over other locations. This basic level of prioritizationallows the indexer to quickly identify which items should be indexedfirst and also to order indexing of items in a basic manner consistentwith processing file types and locations that the user is more likely tointeract with first.

Step 204 receives a query associated with indexable items. The query canbe any suitable query such as, for example, an explicit search where auser has typed a term expecting results, or a query generated by anapplication. For example, a user may interact with an application's userinterface that provides a pivotable view of items presented in the userinterface. Responsive to pivoting the view, the application may spawn aquery. Alternately or additionally, a user might also stack or groupitems to form a query. Step 206 performs an indexing operation based onthe query. This can be performed in any suitable way. For example, thisstep can be performed using, at least in part, an indexer such as thatdescribed above and below.

FIG. 3 is another flow diagram that describes steps in a method inaccordance with one embodiment generally at 300. The method can beimplemented in connection with any suitable hardware, software, firmwareor combination thereof. In at least some embodiments, the method can beimplemented using a system such as the one described above. The order inwhich the method is described is not intended to be construed as alimitation, and any number of the described steps can be combined in anyorder to implement the method as appropriate.

Step 302 receives one or more queries associated with indexable items.This step can be performed in any suitable way. For example, queries canbe generated based upon an explicit user-generated query and/or anapplication-initiated query. Indexable items can include, by way ofexample and not limitation, files or folders in a database. In one ormore embodiments, queries are received and placed into a stack that isto be used by the indexer. The stack determines the order in which theindices associated with each query are updated. The process of updatingthe indices sends notifications to the source of the query so that thesource knows new items are potentially available if the query werere-executed.

Step 304 ascertains priorities associated with items associated with thequeries. This step can be performed in any suitable way. In one or moreembodiments, priorities can be designated specifically by a user,directly or indirectly, or by an application. For example, a user maydirectly designate a priority, such as, for example, responding to aprompt for such a designation. Alternately or additionally, a user mayindirectly assign a priority for a query by opening a Web browser tosearch within a directory of files. In addition, an application maydesignate a priority based on its default programming or settings, or inresponse to user interaction.

Step 306 assigns indexing priorities to index operations associated withthe queries. This step can be performed in any suitable way. Forexample, in one or more embodiments, different prioritization levels canbe employed. As but one example, different prioritization levels caninclude, in descending order of priority, Foreground, High, Low, andDefault. These prioritization levels are described in more detail below.

Step 308 performs one or more indexing operations based on the queriesand assigned indexing priorities. This step can be performed in anysuitable way. From these queries, the indexer can distill relevantinformation which then allows the indexer to focus on the specificsubject of the query in order to perform its indexing operations. Forexample, in one or more embodiments, the indexer can selectively indexitems that may satisfy the query while not prioritizing items which areknown to fall outside of a range of the query. Therefore, new or out ofdate items that are more likely to match the query can be indexed beforeother items. Accordingly, this allows the indexer to service the queryin a more accurate manner. For instance, even though there are itemsthat need to be indexed across the whole system, the indexer may know offiles that belong to a specific directory, such as a music directory. Insuch an example, when a query is generated specific to music files, theindexer is enabled to index the music directory before indexing theother items that need to be processed. This functionality is due to theprioritization of directories that match the query. In this example, themusic directory matches a query for music but does not match a query fora directory that contains text files. Hence, by bypassing unlikelydirectories the indexer can quickly ensure that the results for aspecific query are accurate even though there are still items to beindexed in other directories. Alternatively, in the example aboveinvolving the prioritization of common places that the user has personalfiles, such as a user's directory, the user's directory may be indexedbefore a general operating system directory. Thus, without bringing theentirety of a system up to date, the indexer can specifically focus itswork to bring the specific user's directory up to date.

The assigned priorities, as described above, can have several differentlevels. In the specific example given above, the highest level ofpriority is Foreground. Foreground essentially indicates that aparticular query will cause the indexer to use all or as many systemresources as desirable to bring the indices used by the query up to dateas quickly as possible. Further, indexing work that is to be performedresponsive to this assigned priority will be performed withoutattempting to “back-off”. Back-off behavior generally means that therate of indexing has been slowed in order to prevent the indexing fromusing an undue amount of resources. Using back-off behavior can allowother applications or operations to utilize system resources sufficientto function properly without the indexing adversely impacting systemresources.

A second level of priority is High. A High priority is similar toForeground. Specifically, this priority level causes the indexer to useas many resources as possible to update the indices used by a particularquery except that the indexer will also respect back-off behavior. Anoperation with a High priority will attempt to not adversely impactsystem resources by utilizing back-off behavior. Therefore, this levelof prioritization will accommodate for other operations with a higherprioritization by using less system resources until those higherprioritized operations are completed.

A third level of priority is Low. A Low priority is similar to a Highpriority except for one distinction. Specifically, with a Low priority,a queries indices will be updated only after the indices of any High orForeground query are updated. But, a query with a Low priority will beprioritized ahead of typical background processing. If, for example,another query comes into the stack with a priority of High orForeground, then the indices for the other query will be updated beforethe indicies of the Low priority query. A Low priority query will becomefirst priority if all other queries above it have completed updatingtheir indices or have nothing more to index.

The lowest level of priority is Default. This signifies that there is noprioritization specific to a query. Consequently, the defaultprioritization will be performed along with background processing andwill be prioritized below anything else.

Having described various embodiments as well as methods of operation ingeneral, consider now a description of an implementation example inwhich the described embodiments can be employed.

Implementation Example

In accordance with one or more embodiments, a user can effectivelyperform some sort of action on a user interface, such as pivoting a viewthat in turn causes a query on the indexer. Alternately or additionally,a user may cause a query on the indexer by specifically executing asearch. In one or more embodiments, queries can be based on location aswell as types. For example, a query might be associated with aparticular location in which files are known to be stored. Alternatelyor additionally, queries can be based on file or content types. Forexample, a query might be issued for files that reside in one or moremusic folders. Alternately or additionally, the query might be issuedfor JPEG file types.

As another example, when a user employs an application to browse contentin a database, the user may wish to sort the content in a certain way.For example, the user may wish to group content items according to acontent item's author. For example, a user may wish to select allcontent items that have an author “Chris” or every song by “Coldplay”.When the user takes an action to effect such a filter, a query can bespawned that indicates that indexing is to be performed on items havingthe indicated author. Indexing operations can now be performed on thoseitems that satisfy the query. Other criteria may also be employed todefine a query. Such criteria can include but are not limited to a URL,the last modified time, and/or any other property or parameter providedby or to the system.

In accordance with one or more embodiments, the indexer can utilize atleast two arrays of information. One array of information is showngenerally at 400 in FIG. 4 and comprises an example priority queue. Thepriority queue is a mechanism that is used for organizing within eachelement of a stack. In this example, the priority queue includes threecolumns a first of which entitled “URL to index”, a second of whichentitled “Priority Stack Index”, and a third of which entitled “DefaultPrioritization”. The “URL to index” column contains a list of items toindex. In this example, the items to be indexed are locations based onURLs. The column entitled “Priority Stack Index” indicates a designatedpriority corresponding to each item in the first column. For example,the top two items in the first column have the same designated priorityin the second column and therefore, will be indexed accordingly. Thethird item has a different designated priority in the Priority StackIndex and will be indexed accordingly. The last two items do not havedesignated priorities; therefore, these items will be indexed accordingto Default Prioritization designated in the third column.

A second array of information can be, for example, a stack ofprioritization requests as shown generally at 500 in FIG. 5. In thisexample, the prioritization stack includes two columns a first of whichentitled “Locations to prioritize”, and a second of which entitled“Priority”. The first column includes a list of locations. The secondcolumn includes priority levels assigned to each location in the firstcolumn. In this example, the top element, “C:\foo”, is assigned aForeground priority and the second element, “C:\bar”, is assigned a Highpriority.

The priorities in the prioritization stack interrelate with the priorityqueue in FIG. 4. The interrelation between these two arrays can be shownwith the following example. Assume an indexer has five outstanding itemsto index shown in the first column of the priority queue in FIG. 4.These items will be indexed in top-down sorted order with the items atthe top of the list being indexed first. In this example, items 402 and404 both indicate a priority stack index of “0—top element”. Thisindicates a connection with the top element in the prioritization stackin FIG. 5. There, the top element, “C:\foo”, is assigned a Foregroundpriority. Therefore, the corresponding items to be indexed in FIG. 4will be indexed without any restriction on indexing speed. Item 406 inFIG. 4 shows in the Priority Stack Index a “1—second element”, whichindicates a connection to the second element in the prioritization stackin FIG. 5. There, the second element, “C:\bar”, is assigned a Highpriority. Therefore, item 406 in FIG. 4, “C:\bar\a.txt”, will be indexedaccordingly. The last two items in FIG. 4, items 408 and 410, show thata priority stack index is not found. When the priority stack index isnot found, the corresponding items to be indexed will be prioritizedaccording to default prioritization levels in the third column.Additionally, items having the same assigned priority in the PriorityStack Index column will be indexed according to default prioritiesdesignated in the third column. For example, items 402 and 404 both havea Foreground priority, but their default priorities are High and Low,respectively. This indicates that both items 402 and 404 will be indexedahead of other items with lower priority levels such as item 406, whichhas a High priority as described above. However, within that Foregroundpriority, further prioritization takes place. Item 402 will be indexedbefore item 404 because the priority level for item 402 is higher thanthat of item 404. Once the indexing of items 402 and 404 is completed,the indexer will then service item 406, which is the next item down inthe array. Once item 406 has been indexed, the next item will beindexed. In this example, both of the next two items, items 408 and 410,have the same default High priority shown in the third column. Item 408will be indexed first because it is higher up in the stack.

Once indexing on those items has completed, the indexer will move on toany entry matching the second query in the prioritization stack 500, forexample “C:\bar”. If a new item were to come in for “C:\foo”, that itemwould automatically be inserted into the priority queue 400 at itsproper sorted position. The proper sorted position for such an itemwould be on the top of the stack and would then be processed next. If,for example, a new item prioritized as Low were to come in to the stack,that item would automatically be inserted at the bottom of the priorityqueue 400 and would be prioritized above only those items with defaultprioritization.

In one embodiment, applications can designate a priority level. Forexample, a user may open a music file using their Web browser. Assumethat the Web browser is programmed to assign Foreground priorities tomusic files. The music files will thus be indexed accordingly. However,consider now that the user opens a different application whichprioritizes pictures or images with a High prioritization level. Openingthis application effectively places the Web browser in the background.The Web browser is programmed to understand that it is has not beenclosed, but that the user is no longer interacting with it. Further, theuser, through his or her actions, has essentially indicated that theindexing operations associated with the Web browser are not as importantas indexing operations associated with the newly-opened application.Therefore, in this example, Foreground music file prioritization willdrop down below the new High prioritization for the pictures or images.Accordingly, the indexer would then prioritize music files as High untilthe user takes some other action to re-establish the priorities.

In the example above, the indexing solution may not rely solely on theWeb browser to assign proper priority levels for indexing. Rather, theindexing solution can instead cause priorities to be applied in responseto a user's interaction. Specifically, the Web browser that opened themusic file can still consider its operation to be highly important, butthe indexer will not allow the indexing caused by the Web browser tocontinue with a Foreground priority when the newly-opened application isdeemed to be more important. The indexing solution can enforce aprioritization by overriding the priority level set by the Web browsersufficient to cause the indexing associated with the Web browser to belowered to a High priority in order to accommodate system resources forthe newly-opened application. Accordingly, the solution can keep anoperation or application that is not at the top of the stack from usingan undue amount of system resources. This provides a way for the systemto service the query faster since indexing resources are being limitedand update the indexes more accurately.

In an alternative embodiment, the prioritization can be user specific.For example, when a user opens a window to view their music files, theindexer can identify how out of date an index from apreviously-performed indexing operation is. If the index is out of dateby some definable metric, the indexer may prompt the user by asking ifthe user wants to run indexing in the Foreground. Further, the systemcan keep track of the indexing and notify the user when the indexing iscompleted.

In one embodiment, information that comes from a generated query isadaptable for individual users that may not have actually issued aquery. This approach is dynamic in the sense that it can adapt to userspecific parameters. For example, a user's history information maydescribe what the particular user seems to consume or use more often.This information can be used to modify the indexing priorities. Forexample, if a particular user frequently browses their photos andinfrequently browses their music collection, then the priorities can bemodified to reflect that history.

In one embodiment, applications can determine which item is at the topof a stack of items to be indexed. Such a determination can be inresponse to a user action on a user interface. For example, the item ontop of the stack may be the last request for prioritization on theForeground or High prioritization levels. In addition, an application oruser window or user invocation of an application that designates a queryas Foreground or High can cause a query or item to be positioned at thetop of the stack. If the higher prioritized items in the stack havenothing more to index, an associated entry on the stack will remain onthe stack and the next element of the stack will be indexed. Whenindexing on the next element is complete, indexing will continue witheach subsequent element in the stack until the items remaining are itemswith default priority. For example, consider one Foreground item at thetop of a stack, one High item just underneath, and one Low itemunderneath that. If no indexing is to be done or indexing is complete inthe Foreground or the High items, then the Low item will be indexed. Ifindexing is complete or is not to be done for all items with Foreground,High, and Low priorities, then the Default level prioritization will beindexed.

In one embodiment, the system can operate in a dynamic mode, meaning ifan item further up the stack is changed, then that item will getprioritized and get indexed immediately. For example, assume a user hasa Foreground item and a second item as High. If the user brings intofocus a window associated with the content that is the subject of theHigh prioritization, then indexing associated with the Highprioritization would move ahead of the Foreground prioritization and theForeground prioritization would drop down to High prioritization.

Alternately or additionally, in at least some embodiments, eventing canbe used to affect how indexing is applied. For example, if at a givenpoint in time a new item or a new operation comes into the stack thatwould belong to the top level of the stack, that new item or operationcan occur next. In other words, a new item or operation that enters thestack can be prioritized according to an association with another itemalready located in the stack. Further, in at least some embodiments, thesystem can notify the user that a new item has been added to the user'squery. This notification can allow the user to update any results basedon new items that come into the stack.

In one or more embodiments, the indexer can be configured to reportstatistics based upon query criteria. For example, the indexer canreport how many items are indexed that pertain to a particular query,how many items have yet to be indexed, and how many items have beenindexed before but need re-indexing. Such statistics can be very helpfulin making dynamic decisions. For example, if there are only a few itemsout of date, then Foreground prioritization can be recommended andutilized. However, if there are a substantial number of items out ofdate, then High prioritization can be recommended and utilized. Anapplication can use such statistics to decide what kind ofprioritization it desires. Further, dynamic statistics can be providedduring indexing, which can display the number of items indexed as wellas the number of remaining items to be indexed. As indexing proceeds, anaccurate number of remaining items can be provided to a user orapplication, which can assist the user or application in changing apriority level, if so desired.

Example System

FIG. 6 illustrates an example computing device 600 that can implementthe various embodiments described above. Computing device 600 can be,for example, various computing devices or servers, such as thoseillustrated in FIG. 1 or any other suitable computing device.

Computing device 600 includes one or more processors or processing units602, one or more memory and/or storage components 604, one or moreinput/output (I/O) devices 606, and a bus 608 that allows the variouscomponents and devices to communicate with one another. Bus 608represents one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. Bus 608 can include wired and/or wirelessbuses.

Memory/storage component 604 represents one or more computer storagemedia. Component 604 can include volatile media (such as random accessmemory (RAM)) and/or nonvolatile media (such as read only memory (ROM),Flash memory, optical disks, magnetic disks, and so forth). Component604 can include fixed media (e.g., RAM, ROM, a fixed hard drive, etc.)as well as removable media (e.g., a Flash memory drive, a removable harddrive, an optical disk, and so forth).

One or more input/output devices 606 allow a user to enter commands andinformation to computing device 600, and also allow information to bepresented to the user and/or other components or devices. Examples ofinput devices include a keyboard, a cursor control device (e.g., amouse), a microphone, a scanner, and so forth. Examples of outputdevices include a display device (e.g., a monitor or projector),speakers, a printer, a network card, and so forth.

Various techniques may be described herein in the general context ofsoftware or program modules. Generally, software includes routines,programs, objects, components, data structures, and so forth thatperform particular tasks or implement particular abstract data types. Animplementation of these modules and techniques may be stored on ortransmitted across some form of computer readable media. Computerreadable media can be any available medium or media that can be accessedby a computing device. By way of example, and not limitation, computerreadable media may comprise “computer storage media”.

“Computer storage media” include volatile and non-volatile, removableand non-removable media implemented in any method or technology forstorage of information such as computer readable instructions, datastructures, program modules, or other data. Computer storage mediainclude, but are not limited to, RAM, ROM, EEPROM, flash memory or othermemory technology, CD-ROM, digital versatile disks (DVD) or otheroptical storage, magnetic cassettes, magnetic tape, magnetic diskstorage or other magnetic storage devices, or any other medium which canbe used to store the desired information and which can be accessed by acomputer.

CONCLUSION

Methods and systems provide a tool for prioritizing the ordering ofoutstanding indexing work in order to bring a particular portion of anindexing source up to date quickly and to reduce the likelihood ofinconsistencies between an index-backed view and a direct view of asource. In accordance with the described embodiments, indexing of itemscan be prioritized based upon a user's view or metadata contained withina query. Further, in at least some embodiments, the tool can decide theorder to index items based upon multiple prioritization requests.

Although embodiments have been described in language specific tostructural features and/or methodological steps, it is to be understoodthat the embodiments defined in the appended claims are not necessarilylimited to the specific features or steps described. Rather, thespecific features and steps are disclosed as example forms ofimplementing the claimed embodiments.

1. One or more computer readable storage media comprising computerreadable instructions which, when executed, implement a systemcomprising: an indexer configured to perform indexing on indexable itemsstored at a source, wherein the indexer is configured to prioritizeindexing operations based on one or more queries, the indexingoperations comprising building indices for the indexable items tofacilitate searching over the source, wherein the indexer is furtherconfigured to insert indexable items into a stack and use the stack inassociation with corresponding priorities.
 2. The one or more computerreadable storage media of claim 1, wherein the one or more queriescomprise at least one application-initiated query.
 3. The one or morecomputer readable storage media of claim 1, wherein the one or morequeries comprise at least one user-generated query.
 4. The one or morecomputer readable storage media of claim 1, wherein the indexer isconfigured to utilize priority levels comprising at least Foreground,High, Low, and Default priority levels.
 5. A computer-implemented methodcomprising: prioritizing items to be indexed, the priority of the itemsdetermining an indexing order in which the items are to be indexed,wherein assigned priorities are based, at least in part, on a type ofquery, and wherein one type of query comprises a query associated withuser history information; receiving a query associated with indexableitems; and performing an indexing operation on the items based on thequery, the query being configured to enable the indexing order to bechanged to be a different indexing order.
 6. The computer-implementedmethod of claim 5, wherein assigned priorities are based, at least inpart, on a location.
 7. The computer-implemented method of claim 5,wherein the query comprises an application-initiated query.
 8. Thecomputer-implemented method of claim 5, wherein the query comprises auser-generated query.
 9. The computer-implemented method of claim 5,wherein an order of one or more indexing operations is based, at leastin part, on a location in a stack of priorities.
 10. Thecomputer-implemented method of claim 5, wherein the prioritizingcomprises prioritizing at a plurality of levels some of which beinghigher than others.
 11. A computer-implemented method comprising:receiving one or more queries associated with indexable items, theindexable items not yet associated with indices; ascertaining at leastone priority associated with one or more indexable items associated withthe one or more queries; assigning at least one indexing priority toindex operations associated with the one or more queries; and performingone or more indexing operations based on the one or more queries andassigned indexing priorities, the indexing operations comprisingbuilding indices by capturing descriptive properties and tokenoccurrence information for each indexable item, wherein an order of theindexing operations is based on a location in a stack of prioritizedqueries.
 12. The computer-implemented method of claim 11, wherein theperforming comprises selectively indexing items that satisfy the one ormore queries.
 13. The computer-implemented method of claim 11, whereinindexing priorities can be modified in response to a user action. 14.The computer-implemented method of claim 11 further comprising using astack to manage indexing priorities.
 15. The computer-implemented methodof claim 11, wherein the indexing priorities comprise Foreground, High,Low, and Default priority levels.
 16. The computer-implemented method ofclaim 11, wherein assigned priorities are based, at least in part, onquery types.
 17. A computer-implemented method comprising: prioritizingitems to be indexed, the priority of the items determining an indexingorder in which the items are to be indexed; receiving a query associatedwith indexable items; and performing an indexing operation on the itemsbased on the query, the query being configured to enable the indexingorder to be changed to be a different indexing order, wherein an orderof one or more indexing operations is based, at least in part, on alocation in a stack of priorities.